Discounted payments theorems for large deviations
نویسندگان
چکیده
منابع مشابه
Stone-Weierstrass type theorems for large deviations
We give a general version of Bryc’s theorem valid on any topological space and with any algebra A of real-valued continuous functions separating the points, or any wellseparating class. In absence of exponential tightness, and when the underlying space is locally compact regular and A constituted by functions vanishing at infinity, we give a sufficient condition on the functional Λ(·)|A to get ...
متن کاملAccelerated decomposition techniques for large discounted Markov decision processes
Many hierarchical techniques to solve large Markov decision processes (MDPs) are based on the partition of the state space into strongly connected components (SCCs) that can be classified into some levels. In each level, smaller problems named restricted MDPs are solved, and then these partial solutions are combined to obtain the global solution. In this paper, we first propose a novel algorith...
متن کاملLarge deviations of combinatorial distributions II: Local limit theorems
This paper is a sequel to our paper [17] where we derived a general central limit theorem for probabilities of large deviations1 applicable to many classes of combinatorial structures and arithmetic functions; we consider corresponding local limit theorems in this paper. More precisely, given a sequence of integral random variables {Ωn}n≥1 each of maximal span 1 (see below for definition), we a...
متن کاملLarge Deviations of Combinatorial Distributions I: Central Limit Theorems
We prove a general central limit theorem for probabilities of large deviations for sequences of random variables satisfying certain natural analytic conditions. This theorem has wide applications to combinatorial structures and to the distribution of additive arithmetical functions. The method of proof is an extension of Kubilius’ version of Cramér’s classical method based on analytic moment ge...
متن کاملLarge Deviations for Large Capacity
In this paper, we study large deviations of large capacity loss networks with xed routing. We use two-level modelling for the loss networks: the call level and the cell level. At the call level, a call request is accepted if it succeeds an admission test. The test is based on a polyhedral set of the number of calls in progress when a new call arrives. After being accepted, a call then transmits...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lietuvos matematikos rinkinys
سال: 2016
ISSN: 2335-898X,0132-2818
DOI: 10.15388/lmr.a.2016.06